A Factorization of the Conway Polynomial and Covering Linkage Invariants

نویسندگان

  • TATSUYA TSUKAMOTO
  • AKIRA YASUHARA
چکیده

J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the μ̄-invariants of a string link with the link as its closure. We give another description of the latter factor: the determinant of a matrix whose entries are linking pairings in the infinite cyclic covering space of the knot complement, which take values in the quotient field of Z[t, t]. In addition, we give a relation between the Taylor expansion of a linking pairing around t = 1 and derivation on links which is invented by T.D. Cochran. In fact, the coefficients of the powers of t − 1 will be the linking numbers of certain derived links in S. Therefore, the first non-vanishing coefficient of the Conway polynomial is determined by the linking numbers in S. This generalizes a result of J. Hoste. 1. Statement of Results Let L be an oriented (m + 1)-component link (m ≥ 1) in the 3-sphere S3. Throughout the paper knots and links are assumed to be oriented. It is interesting but difficult in general to figure out the structure of a link invariant. The Conway polynomial ∇L(z) of L , the most popular polynomial link invariant, was not an exception, either. However, J.P. Levine [6] made a breakthrough. Namely he showed that there is a following relationship between ∇L(z) and ∇K(z), where K is a knot obtained from L by banding together the components and Γ(z) is a power series in z which depends on the choice of bands: ∇L(z) = ∇K(z) Γ(z). Viewing the choice of bands as the choice of a string link represenation of L, Levine descrived Γ(z) by μ̄-invariants of the string link as follows. Theorem 1.1. ([6] Theorem 1) Let S be a string link, with closure LS and knot closure KS. Then we have that ∇LS (z) = ∇KS(z)ΓS(z), where ΓS(z) is a power series given by the formula: ΓS(z) = (u+ 1) e/2 det(λij(u)) with z = u/ √ u+ 1, e = { 0 if m is even 1 if m is odd and :

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Jones knot Invariants and Vassiliev Invariants

We show that the n-th derivative of a quantum group invariant, evaluated at 1, is a Vassiliev invariant while the derivative of the Jones polynomial, evaluated at a real number 6 = 1, is not a Vassiliev in variant. The coeecients of the classical Conway polynomial are known to be Vassiliev invariants. We show that the coeecients of the Jones polynomial are not vassiliev invariants.

متن کامل

Chirality and the Conway Polynomial

We conjecture that for the Conway polynomial C(z) of an amphicheiral knot, the product C(z)C(iz)C(z 2) must be a square inside the ring of polynomials with Z 4 coefficients. This conjecture has two ancestors. One is a theorem of Kawauchi and Hartley, which says that the Conway polynomial of a strongly amphicheiral knot must decompose as φ(z)φ(−z). This implies our main conjecture, at least for ...

متن کامل

Finite Type Invariants of 3-Manifolds

Contents 1 Introduction 2 2 Finiteness 13 3 The Conway polynomial 20 4 Finite type invariants from quantum invariants 30 5 Combinatorial structure of finite type invariants 47 6 Finite type invariants for spin manifolds 58 7 Finite type invariants for bounded manifolds 61 8 Finite type invariants for marked manifolds 62 9 Further generalizations 65 10 Relationships with other theories and other...

متن کامل

New Bases for Polynomial-Based Spaces

Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004